Probabilistic Heuristics for Disseminating Information in Networks
نویسندگان
چکیده
منابع مشابه
Disseminating Traffic Information in Vehicular Networks
Muhammad Alyas Shahid Department of Computer Science, COMSATS Institute of Information Technology, Wah Cantt Email : [email protected] Aisha Azeem Department of Computer Science, COMSATS Institute of Information Technology, Wah Cantt Email : [email protected] --------------------------------------------------------------------ABSTRACT-------------------------------------------------------...
متن کاملNegotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks
In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation), that eÆciently disseminate information among sensors in an energy-constrained wireless sensor network. Nodes running a SPIN communication protocol name their data using high-level data descriptors, called meta-data. They use meta-data negotiations to eliminate the transmissi...
متن کاملDisseminating Mobile Agents for Distributed Information Filtering
An often claimed benefit of mobile agent technology is the reduction of communication cost. Especially the area of information filtering has been proposed for the application of mobile filter agents. However, an effective coordination of agents, which takes into account the current network conditions, is difficult to achieve. This contribution analyses the situation that data distributed among ...
متن کاملCost-Sensitive Reachability Heuristics for Probabilistic Planning
Reachability heuristics have lead to impressive scale-ups in deterministic planning making their application to probabilistic planning a promising research direction. We describe how one such reachability heuristic (based on planning graphs) can be extended to handle a class of cost-sensitive probabilistic planning problems. Specifically, we address the problem of conformant (non-observable) pr...
متن کاملOccupation Measure Heuristics for Probabilistic Planning
For the past 25 years, heuristic search has been used to solve domain-independent probabilistic planning problems, but with heuristics that determinise the problem and ignore precious probabilistic information. To remedy this situation, we explore the use of occupation measures, which represent the expected number of times a given action will be executed in a given state of a policy. By relaxin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2007
ISSN: 1063-6692
DOI: 10.1109/tnet.2007.892877